Conjugacy and episturmian morphisms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characteristic morphisms of generalized episturmian words

In a recent paper with L. Q. Zamboni, the authors introduced the class of θ-episturmian words. An infinite word over A is standard θepisturmian, where θ is an involutory antimorphism of A∗, if its set of factors is closed under θ and its left special factors are prefixes. When θ is the reversal operator, one obtains the usual standard episturmian words. In this paper, we introduce and study θ-c...

متن کامل

On a Generalization of Standard Episturmian Morphisms

In a recent paper with L. Q. Zamboni the authors introduced the class of θ-episturmian words, where θ is an involutory antimorphism of the free monoid A∗. In this paper, we introduce and study θcharacteristic morphisms, that is, morphisms which map standard episturmian words into standard θ-episturmian words. They are a natural extension of standard episturmian morphisms. The main result of the...

متن کامل

Episturmian morphisms and a Galois theorem on continued fractions

We associate with a word w on a finite alphabet A an episturmian (or Arnoux-Rauzy) morphism and a palindrome. We study their relations with the similar ones for the reversal of w. Then when |A| = 2 we deduce, using the Sturmian words that are the fixed points of the two morphisms, a proof of a Galois theorem on purely periodic continued fractions whose periods are the reversal of each other. Ma...

متن کامل

Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words

Words 2005-Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words – p.1/11

متن کامل

Palindromic prefixes and episturmian words

Let w be an infinite word on an alphabet A. We denote by (ni)i≥1 the increasing sequence (assumed to be infinite) of all lengths of palindromic prefixes of w. In this text, we give an explicit construction of all words w such that ni+1 ≤ 2ni + 1 for all i, and study these words. Special examples include characteristic Sturmian words, and more generally standard episturmian words. As an applicat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2003

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(02)00726-0